Arithmetic operations on ordinals.
نویسندگان
چکیده
منابع مشابه
Arithmetic Operations on Trapezoidal Fuzzy Numbers
In this paper, several new algebraic mathematics for positive fuzzy numbers of type (a,a,a,a) are devised and do not need the computation of α-cut of the fuzzy number. Direct mathematical expressions to evaluate exponential, square root, logarithms, inverse exponential etc. of positive fuzzy numbers of type (a,a,a,a) are obtained using the basic analytical principles of algebraic mathematics an...
متن کاملAdams Operations on Higher Arithmetic K-theory
We construct Adams operations on the rational higher arithmetic K-groups of a proper arithmetic variety. The definition applies to the higher arithmetic K-groups given by Takeda as well as to the groups suggested by Deligne and Soulé, by means of the homotopy groups of the homotopy fiber of the regulator map. They are compatible with the Adams operations on algebraic K-theory. The definition re...
متن کاملVisual Learning of Arithmetic Operations
A simple Neural Network model is presented for end-to-end visual learning of arithmetic operations from pictures of numbers. The input consists of two pictures, each showing a 7-digit number. The output, also a picture, displays the number showing the result of an arithmetic operation (e.g., addition or subtraction) on the two input numbers. The concepts of a number, or of an operator, are not ...
متن کاملReview on: Providing Arithmetic Operations on RSA using Homomorphic Technique
Cloud computing is the sending of computing as a service rather than a product; and shared resources, software, and message are given to computers and other devices as a utility over a network. Traditionally departments store and maintain information in their own data centres, over which they had complete control. With the emergence of cloud computing organizations can store data in the cloud p...
متن کاملTuring computations on ordinals
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of Gödel’s constructible universe L. This characterization can be used to prove the generalized continuum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1975
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093891903